class Solution02 {
    public int[] productExceptSelf(int[] nums) {
        int n = nums.length;
        // 前缀积 f[i] : 代表当前位置之前的乘积
        // [1,1,2,6]
        int[] f = new int[n];
        f[0] = 1;
        for (int i = 1; i < n; i++) {
            f[i] = f[i - 1] * nums[i - 1];
        }
        // 后缀积
        // [24,12,4,1]
        int[] g = new int[n];
        g[n - 1] = 1;
        for (int i = n - 2; i >= 0; i--) {
            g[i] = g[i + 1] * nums[i + 1];
        }
        int[] ret = new int[n];
        for (int i = 0; i < n; i++) {
            ret[i] = f[i] * g[i];
        }
        return ret;
    }
}